COMPUTING IN ALGEBRAIC SYSTEMSTUCKER JV.1980; LONDON MATH. SOC. LECTURE NOTE SER.; GBR; DA. 1980; NO 45; PP. 215-235; BIBL. 25 REF.Conference Paper

HOARE'S LOGIC AND PEANO'S ARITHMETICBERGSTRA JA; TUCKER JV.1983; THEOR. COMPUT. SCI.; ISSN 0304-3975; NLD; DA. 1983; VOL. 22; NO 3; PP. 265-284; BIBL. 20 REF.Article

A CHARACTERISATION OF COMPUTABLE DATA TYPES BY MEANS OF A FINITE EQUATIONAL SPECIFICATION METHODBERGSTRA JA; TUCKER JV.1980; LECTURE NOTES COMPUTER SCI.; DEU; DA. 1980; NO 85; PP. 76-90; BIBL. 11 REF.Conference Paper

ON THE ADEQUACY OF FINITE EQUATIONAL METHODS FOR DATA TYPE SPECIFICATIONBERGSTRA JA; TUCKER JV.1979; SIGPLAN NOT.; USA; DA. 1979; VOL. 14; NO 11; PP. 13-18; BIBL. 10 REF.Article

ALGEBRAICALLY SPECIFIED PROGRAMMING SYSTEMS AND HOARE'S LOGICBERGSTRA JA; TUCKER JV.1981; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1981; NO 115; PP. 348-362; BIBL. 30 REF.Conference Paper

COMPLEXITY THEORY AND THE OPERATIONAL STRUCTURE OF ALGEBRAIC PROGRAMMING SYSTEMSASVELD PRJ; TUCKER JV.1982; ACTA INFORMATICA; ISSN 0001-5903; DEU; DA. 1982; VOL. 17; NO 4; PP. 451-476; BIBL. 32 REF.Article

EXPRESSIVENESS AND THE COMPLETENESS OF HOARE'S LOGICBERGSTRA JA; TUCKER JV.1982; JOURNAL OF COMPUTER AND SYSTEM SCIENCES; ISSN 0022-0000; USA; DA. 1982; VOL. 25; NO 3; PP. 267-284; BIBL. 25 REF.Article

SOME NATURAL STRUCTURES WHICH FAIL TO POSSESS A SOUND AND DECIDABLE HOARE-LIKE LOGIC FOR THEIR WHILE-PROGRAMSBERGSTRA JA; TUCKER JV.1982; THEOR. COMPUT. SCI.; ISSN 0304-3975; NLD; DA. 1982; VOL. 17; NO 3; PP. 303-315; BIBL. 25 REF.Article

TWO THEOREMS ABOUT THE COMPLETENESS OF HOARE'S LOGICBERGSTRA JA; TUCKER JV.1982; INF. PROCESS. LETT.; ISSN 0020-0190; NLD; DA. 1982; VOL. 15; NO 4; PP. 143-149; BIBL. 14 REF.Article

THE REFINEMENT OF SPECIFICATIONS AND THE STABILITY OF HOARE'S LOGICBERGSTRA JA; TUCKER JV.1981; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1981 PUBL. 1982; NO 131; PP. 24-36; BIBL. 15 REF.Conference Paper

INITIAL AND FINAL ALGEBRA SEMANTICS FOR DATA TYPE SPECIFICATIONS: TWO CHARACTERIZATION THEOREMSBERGSTRA JA; TUCKER JV.1983; SIAM JOURNAL ON COMPUTING; ISSN 0097-5397; USA; DA. 1983; VOL. 12; NO 2; PP. 366-387; BIBL. 26 REF.Article

FLOYD'S PRINCIPLE, CORRECTNESS THEORIES AND PROGRAM EQUIVALENCEBERGSTRA JA; TIURYN J; TUCKER JV et al.1982; THEOR. COMPUT. SCI.; ISSN 0304-3975; NLD; DA. 1982; VOL. 17; NO 2; PP. 113-149; BIBL. 35 REF.Article

FINITE ALGORITHME PROCEDURES AND INDUCTIVE DEFINABILITYMOLDESTAD J; STOLTENBERG HANSEN V; TUCKER JV et al.1980; MATH. SCAND.; DNK; DA. 1980; VOL. 46; NO 1; PP. 62-76; BIBL. 19 REF.Article

FINITE ALGORITHMIC PROCEDURES AND COMPUTATION THEORIESMOLDESTAD J; STOLTENBERG HANSEN V; TUCKER JV et al.1980; MATH. SCAND.; DNK; DA. 1980; VOL. 46; NO 1; PP. 77-94Article

ON THE POWER OF ALGEBRAIC SPECIFICATIONSBERGSTRA JA; BROY M; TUCKER JV et al.1981; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1981; NO 118; PP. 193-204; BIBL. 1 P.Conference Paper